Monte Carlo and quasi-Monte Carlo methods
نویسنده
چکیده
Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Carlo quadrature is attained using quasi-random (also called low-discrepancy) sequences, which are a deterministic alternative to random or pseudo-random sequences. The points in a quasi-random sequence are correlated to provide greater uniformity. The resulting quadrature method, called quasi-Monte Carlo, has a convergence rate of approximately O((log N^N'). For quasi-Monte Carlo, both theoretical error estimates and practical limitations are presented. Although the emphasis in this article is on integration, Monte Carlo simulation of rarefied gas dynamics is also discussed. In the limit of small mean free path (that is, the fluid dynamic limit), Monte Carlo loses its effectiveness because the collisional distance is much less than the fluid dynamic length scale. Computational examples are presented throughout the text to illustrate the theory. A number of open problems are described.
منابع مشابه
Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملMonte Carlo Extension of Quasi-monte Carlo
This paper surveys recent research on using Monte Carlo techniques to improve quasi-Monte Carlo techniques. Randomized quasi-Monte Carlo methods provide a basis for error estimation. They have, in the special case of scrambled nets, also been observed to improve accuracy. Finally through Latin supercube sampling it is possible to use Monte Carlo methods to extend quasi-Monte Carlo methods to hi...
متن کاملQuasi - Monte Carlo Methods in Computer Graphics
The problem of global illumination in computer graphics is described by a Fredholm integral equation of the second kind. Due to the complexity of this equation, Monte Carlo methods provide an efficient tool for the estimation of the solution. A new approach, using quasi-Monte Carlo integration, is introduced and compared to Monte Carlo integration. We discuss some theoretical aspects and give n...
متن کاملQuasi-Monte Carlo sampling to improve the efficiency of Monte Carlo EM
In this paper we investigate an efficient implementation of the Monte Carlo EM algorithm based on Quasi-Monte Carlo sampling. The Monte Carlo EM algorithm is a stochastic version of the deterministic EM (Expectation-Maximization) algorithm in which an intractable E-step is replaced by a Monte Carlo approximation. Quasi-Monte Carlo methods produce deterministic sequences of points that can signi...
متن کاملQuasi-Monte Carlo and Monte Carlo Methods and their Application in Finance
We give an introduction to and a survey on the use of Quasi-Monte Carlo and of Monte Carlo methods especially in option pricing and in risk management. We concentrate on new techniques from the Quasi-Monte Carlo theory.
متن کاملHigher order quasi-Monte Carlo methods: A comparison
Quasi-Monte Carlo is usually employed to speed up the convergence of Monte Carlo in approximating multivariate integrals. While convergence of the Monte Carlo method is O(N−1/2), that of plain quasi-Monte Carlo can achieve O(N−1). Several methods exist to increase its convergence to O(N−α ), α > 1, if the integrand has enough smoothness. We discuss two methods: lattice rules with periodization ...
متن کامل